A Quick and Dirty Irreducibility Test for Multivariate Polynomials over Fq
نویسندگان
چکیده
2000 AMS Subject Classification: Primary 12E05
منابع مشابه
On the reducibility of some composite polynomials over finite fields
Let Fq be a Galois field with q = p elements of characteristic p, and Fq is multiplicative group of Fq. The problem of irreducibility of polynomials and determining the reducibility of a given polynomial stems both from mathematical theory and applications. At mathematical aspects determining the reducibility of a polynomial often appears in number theory, combinatorics and algebraic geometries...
متن کاملDeterministic Irreducibility Testing of Polynomials over Large Finite Fields
We present a sequential deterministic polynomial-time algorithm for testing dense multivariate polynomials over a large finite field for irreducibility. All previously known algorithms were of a probabilistic nature. Our deterministic solution is based on our algorithm for absolute irreducibility testing combined with Berlekamp’s algorithm.
متن کاملIntegral and homothetic indecomposability with applications to irreducibility of polynomials
Being motivated by some methods for construction of homothetically indecomposable polytopes, we obtain new methods for construction of families of integrally indecomposable polytopes. As a result, we find new infinite families of absolutely irreducible multivariate polynomials over any field F . Moreover, we provide different proofs of some of the main results of Gao [2].
متن کاملFast Parallel Absolute Irreducibility Testing
We present a fast parallel deterministic algorithm for testing multivariate integral polynomials for absolute irreducibility, that is irreducibility over the complex numbers. More precisely, we establish that the set of absolutely irreducible integral polynomials belongs to the complexity class NC of Boolean circuits of polynomial size and logarithmic depth. Therefore it also belongs to the cla...
متن کاملFactoring multivariate polynomials via partial differential equations
A new method is presented for factorization of bivariate polynomials over any field of characteristic zero or of relatively large characteristic. It is based on a simple partial differential equation that gives a system of linear equations. Like Berlekamp’s and Niederreiter’s algorithms for factoring univariate polynomials, the dimension of the solution space of the linear system is equal to th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Experimental Mathematics
دوره 14 شماره
صفحات -
تاریخ انتشار 2005